Structured low-density parity-check codes over non-binary fields

Title: Structured low-density parity-check codes over non-binary fields
Creator: Johnson, Sarah J.; Weller, Steven R.
Relation: 5th Australian Communication Theory Workshop, 2004 (AusCTW 2004). Proceedings: 5th Australian Communication Theory Workshop, 2004 (Newcastle, NSW 4-6 February, 2004) p. 18-22
Relation: http://www.eecs.newcastle.edu.au/AusCTW2004/home.html
Publisher: Australian National University
Resource Type: conference paper
Date: 2004
Description: This paper considers low-density parity-check (LDPC) codes defined over non-binary, finite fields GF(q),q = 2p. We find that the difficulty in constructing q-ary LDPC codes whose Tanner graphs are free of short cycles increases as the order of the field increases. By employing combinatorial designs to devise structured q-ary LDPC codcs with guaranteed minimum girth, we show that significant improvements in performance over binary LDPC codes are possible, particularly in the case of short, or high rate, codes. We present a simple construction for rank deficient q-ary LDPC codes.
Subject: low-density parity-check (LDPC) codes; non-binary codes; rank-deficient parity-check matrices
Identifier: http://hdl.handle.net/1959.13/31542
Identifier: uon:2760
Identifier: ISBN:0958034540
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT03	Publisher version (open access)	576 KB	Adobe Acrobat PDF	View Details Download